Unstable Asymptomatics for Nonstationary Queues
نویسندگان
چکیده
We relate laws of large numbers and central limit theorems for nonstationary counting processes to corresponding limits for their inverse processes. We apply these results to develop approximations for queues that are unstable in a nonstationary manner. We obtain unstable nonstationary analogs of the queueing relation L = λW and associated central-limit-theorem versions. For modeling and to obtain the first limits, we can construct nonstationary point processes as random time-transformations of familiar point processes, such as renewal processes and stationary point processes. We deduce the asymptotic behavior of the nonstationary point process from the asymptotic behavior of the familiar point process and the time transformation.
منابع مشابه
Nonstationary Erlang Loss Queues and Networks
ALNOWIBET, KHALID ABDULAZIZ Nonstationary Erlang Loss Queues and Networks. (Under the direction of Dr. Harry Perros) The nonstationary Erlang loss model is a queueing system consisting of a finite number of servers and no waiting room with a nonstationary arrival process or a time-dependent service rate. The Erlang loss model is commonly used to model and evaluate many communication systems. Of...
متن کاملA Simple Approximation for Modeling Nonstationary Queues
Evaluation of the behavior of queues with nonsta-tionary arrival processes is of importance in several applications including communication networks. However , the analysis of nonstationary queues is in general computationally complex, and seldom produces closed form expressions. Thus approximation methods may be more appropriate. In this paper, the pointwise stationary uid ow approximation (PS...
متن کاملA Poisson-Charlier approximation for nonstationary queues
In this paper, we develop a new approximation for nonstationary multiserver queues with abandonment. Our method uses the Poisson–Charlier polynomials, which are a discrete orthogonal polynomial sequence that is orthogonal with respect to the Poisson distribution. We show that by appealing to the Poisson–Charlier polynomials that we can estimate the mean, variance, and probability of delay of ou...
متن کاملNonstationary analysis of the loss queue and of queueing networks of loss queues
We present an iterative scheme based on the fixed point approximation method, for the numerical calculation of the time-dependent mean number of customers and blocking probability functions in a nonstationary queueing network with multi-rate loss queues. We first show how the proposed method can be used to analyze a single-class, multiclass, and multi-rate nonstationary loss queue. Subsequently...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 19 شماره
صفحات -
تاریخ انتشار 1994